New 2D Parallel Thinning Algorithms Based on Critical Kernels
نویسندگان
چکیده
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.
منابع مشابه
Note on fifteen 2D parallel thinning algorithms
We present a study of fifteen parallel thinning algorithms, based on the framework of critical kernels. We prove that ten among these fifteen algorithms indeed guarantee topology preservation, and give counter-examples for the five other ones. We also investigate, for some of these algorithms, the relation between the medial axis and the obtained homotopic skeleton.
متن کاملNew characterizations, in the framework of critical kernels, of 2D, 3D and 4D minimal non-simple sets and P-simple points
Critical kernels constitute a general framework in the category of abstract complexes for the study of parallel homotopic thinning in any dimension. In this article, we present new results linking critical kernels to minimal nonsimple sets (MNS) and P-simple points, which are notions conceived to study parallel thinning in discrete grids. We show that these two previously introduced notions can...
متن کامل2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation
Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient cond...
متن کاملHexagonal parallel thinning algorithms based on sufficient conditions for topology preservation
Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input images are sampled on orthogonal grids. This paper presents new sufficient conditions for topology preserving reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexa...
متن کاملA 3D Sequential Thinning Scheme Based on Critical Kernels
We propose a new generic sequential thinning scheme based on the critical kernels framework. From this scheme, we derive sequential algorithms for obtaining ultimate skeletons and curve skeletons. We prove some properties of these algorithms, and we provide the results of a quantitative evaluation that compares our algorithm for curve skeletons with both sequential and parallel ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006